Dealing with Disagreements: Looking Beyond the Majority Vote in Subjective Annotations
نویسندگان
چکیده
Abstract Majority voting and averaging are common approaches used to resolve annotator disagreements derive single ground truth labels from multiple annotations. However, annotators may systematically disagree with one another, often reflecting their individual biases values, especially in the case of subjective tasks such as detecting affect, aggression, hate speech. Annotator capture important nuances that ignored while aggregating annotations a truth. In order address this, we investigate efficacy multi-annotator models. particular, our multi-task based approach treats predicting each annotators’ judgements separate subtasks, sharing learned representation task. We show this yields same or better performance than data prior training across seven different binary classification tasks. Our also provides way estimate uncertainty predictions, which demonstrate correlate annotation traditional methods. Being able model is useful deployment scenarios where knowing when not make prediction important.
منابع مشابه
Entropy production in the majority-vote model.
We analyzed the entropy production in the majority-vote model by using a mean-field approximation and Monte Carlo simulations. The dynamical rules of the model do not obey detailed balance so that entropy is continuously being produced. This nonequilibrium stochastic model is known to have a critical behavior belonging to the universality class of the equilibrium Ising model. We show that the e...
متن کاملSupplementary Material – Ambiguity Helps: Classification with Disagreements in Crowdsourced Annotations
In this section we give all the necessary details to implement the EP algorithm [1] for the GPCconf method described in the main manuscript. We show how to compute the EP posterior approximation from the product of all approximate factors and how to implement the EP updates to refine each approximate factor. We also show how to compute the EP approximation of the marginal likelihood and its gra...
متن کاملMajority vote following a debate
Voters determine their preferences over alternatives based on cases (or arguments) that are raised in the public debate. Each voter is characterized by a matrix, measuring how much support each case lends to each alternative, and her ranking is additive in cases. We show that the majority vote in such a society can be any function from sets of cases to binary relations over alternatives. A simi...
متن کاملMajority Vote Algorithm Revisited Again
In his article Experience with Software Specification and Verification Using LP, the Larch Proof Assistant, Manfred Broy verified (as one of his smaller case studies) the Majority Vote Algorithm by Boyer and Moore. LP requires that all user theories are expressed axiomatically. I reworked the example in Isabelle/HOL and turned it into a definitional development, thus proving its consistency. In...
متن کاملMjrty|a Fast Majority Vote Algorithm 1
A new algorithm is presented for determining which, if any, of an arbitrary number of candidates has received a majority of the votes cast in an election. The number of comparisons required is at most twice the number of votes. Furthermore, the algorithm uses storage in a way that permits an eecient use of magnetic tape. A Fortran version of the algorithm is exhibited. The Fortran code has been...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Association for Computational Linguistics
سال: 2022
ISSN: ['2307-387X']
DOI: https://doi.org/10.1162/tacl_a_00449